Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
نویسندگان
چکیده
منابع مشابه
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
We study the maximum induced matching problem on a graph G. Induced matchings correspond to independent sets in L2(G), the square of the line graph of G. The problem is NP-complete on bipartite graphs. In this work, we show that for a number of graph families with forbidden vertex orderings, almost all forbidden patterns on three vertices are preserved when taking the square of the line graph. ...
متن کاملSimple vertex ordering characterizations for graph search
Graph searching is fundamental. Many graph algorithms employ some mechanism for systematically visiting all vertices and edges of a given graph. After choosing some initial sequence of vertices, it is natural to choose as the next vertex to visit some vertex that is adjacent to a previously visited vertex whenever possible. This statement describes graph search in its most general setting. When...
متن کاملVertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
Asteroidal Triple-free (AT-free) graphs have received considerable attention due to their inclusion of various important graphs families, such as interval and cocomparability graphs. The asteroidal number of a graph is the size of a largest subset of vertices such that the removal of the closed neighbourhood of any vertex in the set leaves the remaining vertices of the set in the same connected...
متن کاملDynamic Approximate Vertex Cover and Maximum Matching
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first data structure that simultaneously achieves a constant approximation factor and handles a sequence of k updates in k · polylog(n) time. Previous data structures require a polynomial amount of ...
متن کاملVertex-ordering Algorithms for Automatic Differentiation of Computer Codes
In the context of Automatic Differentiation of functions represented by computer code via the vertex elimination approach first advocated by Griewank and Reese (Automatic Differentiation of Algorithms, SIAM, 1991, p126-135), we present two approximate algorithms based on the linearised computational graph of the input code. The first is a statement reordering algorithm aiming to tune the AD-gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-00538-5